package org.example.leetcode;

/**
 * @version 1.0.0
 * @author: lynn
 * @description:
 * @date: 2021/8/12 10:35
 */
public class LC64 {
    public static void main(String[] args) {
        LC64 lc=new LC64();
        int[][] grid={{1,2,3},{4,5,6}};
        System.out.println(lc.minPathSum(grid));

    }

    public int minPathSum(int[][] grid) {
        int m=grid.length;
        int n=grid[0].length;
        int[][] dp=new int[m][n];
        dp[0][0]=grid[0][0];
        for (int i = 1; i <m ; i++) {
            for (int j = 1; j <n ; j++) {
               if (i==0&& j==0) continue;
               if (i==0 && j!=0){
                                  }
            }
        }
        return dp[m-1][n-1];
    }
}
